Path decomposition - PDFSEARCH.IO - Document Search Engine

Path decomposition
Results: 318

#	Item
111	arXiv:1401.2906v3 [math.CO] 18 AugAN Lp THEORY OF SPARSE GRAPH CONVERGENCE I: LIMITS, SPARSE RANDOM GRAPH MODELS, AND POWER LAW DISTRIBUTIONS CHRISTIAN BORGS, JENNIFER T. CHAYES, HENRY COHN, AND YUFEI ZHAO Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-08-18 20:27:12 Graph Dense graph Szemerédi regularity lemma Planar separator theorem Path decomposition Graph theory Mathematics Random graph
112	New Races in Parameterized Algorithmics Christian Komusiewicz and Rolf Niedermeier Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany {christian.komusiewicz,rolf.niedermeier}@tu-berlin.de Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-08-07 06:26:48 NP-complete problems Parameterized complexity Kernelization Path decomposition Vertex cover Feedback vertex set Dominating set Tree decomposition Clique Graph theory Theoretical computer science Mathematics
113	Bandwidth Approximation of a Restricted Family of Trees Abstract Bandwidth is one of the canonical NP-complete problemsIt is NP-hard to approximate within any constant, even on treesGupta gave a randomized Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2009-12-02 23:05:21 NP-complete problems Tree Clique Path decomposition Graph coloring Graph theory Theoretical computer science Mathematics
114	k Newsletter of the Parameterized Complexity Community fpt.wikidot.com www.fpt.wikidot.com Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2014-10-14 03:31:39 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity Michael Fellows Kernelization Clique problem Vertex cover Path decomposition Theoretical computer science Computational complexity theory Applied mathematics
115	Lower Bounds for (Weak) Sense of Direction Paolo Boldi∗ Sebastiano Vigna∗ Abstract Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2002-05-18 04:50:44 Connectivity Representation Graph Cayley graph Path decomposition Universal graph Graph theory Mathematics Matroid theory
116	An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs Jon Kleinberg ∗ Abstract Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2005-08-11 23:51:43 Tree Graph coloring Minor Path decomposition Planar separator theorem Graph theory Graph operations Planar graph
117	Coverings That Preserve Sense of Direction∗ Paolo Boldi† Sebastiano Vigna† Abstract Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2002-05-18 04:50:12 Graph Directed graph Connectivity Path decomposition Bipartite double cover Graph theory Voltage graph Topology
118	Journal of Artificial Intelligence Research–388 Submitted 10/11; publishedComputing All-Pairs Shortest Paths by Leveraging Low Treewidth Add to Reading List Source URL: www.jair.org Language: English - Date: 2012-03-19 16:09:33 Tree decomposition Interval graph Floyd–Warshall algorithm Neighbourhood Clique Split graph Shortest path problem Path decomposition Degeneracy Graph theory Graph operations Chordal graph
119	arXiv:0905.3806v1 [math.CO] 23 MayLimits of randomly grown graph sequences Christian Borgs∗, Jennifer Chayes∗ , L´aszl´o Lov´asz†, Vera S´os‡, Katalin Vesztergombi† February 2009 Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2009-08-18 13:37:24 Petersen graph Topology Degree Graph Continuous function Path decomposition Centrality Graph theory Mathematics Random graph
120	Notes on Large Angle Crossing Graphs Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-16 14:47:12 Petersen graph Path decomposition Graph theory Graph Planar graphs

UPDATE